Extending Planning Graphs to an ADL Subset
نویسندگان
چکیده
We describe an extension of graphplan to a subset of ADL that allows conditional and universally quanti ed e ects in operators in such a way that almost all interesting properties of the original graph plan algorithm are preserved
منابع مشابه
Towards an Integration of Golog and Planning
The action language Golog has been applied successfully to the control of robots, among other things. Perhaps its greatest advantage is that a user can write programs which constrain the search for an executable plan in a flexible manner. However, when general planning is needed, Golog supports this only in principle, but does not measure up with state-of-the-art planners. In this paper we prop...
متن کاملDTG-Plan:Fast Planning by Search in Domain Transition Graphs
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional STRIPS/ADL formalism, SAS+ is capable of capturing vital information such as domain transition structures and causal dependencies. DTG-Plan uses a new SAS+ based incomplete planning approach. Instead of using SAS+ to d...
متن کاملOn the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle
Integrating agent programming languages and efficient action planning is a promising approach because it combines the expressive power of languages such as Golog with the possibility of searching for plans efficiently. In order to integrate a Golog interpreter with a planner, one has to understand, however, which part of the expressiveness of Golog can be captured by the planning language. Usin...
متن کاملUCPOP: A Sound, Complete, Partial Order Planner for ADL
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional e ects, universally quanti ed preconditions and e ects, and with universally quanti ed goals. We prove ucpop is both sound and complete for this representation and describe a practical implementation that succeeds...
متن کاملFast Planning by Search in Domain Transition Graphs∗
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional STRIPS/ADL formalism, SAS+ is capable of capturing vital information such as domain transition structures and causal dependencies. In this paper, we propose a new SAS+ based incomplete planning approach. Instead of usi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997